Continuous algorithms
نویسندگان
چکیده
منابع مشابه
Continuous Orthonormalization Algorithms
The difficulties with the simple shooting method for the solution of ordinary differential boundary value problems are well known, and there have been many suggested modifications to overcome them. Notable among them are the discrete orthonormalization process of Godunov and Conte (1966), the multiple shooting method (Keller(1968) and Osborne(1969)) and the Riccati transformation method (Scott(...
متن کاملQuantum algorithms for continuous problems
Many problems in science and engineering are formulated using continuous mathematical models. Usually they can only be solved numerically and therefore approximately. Since they are often difficult to solve on a classical computer it’s interesting to investigate whether they can be solved faster on a quantum computer. After a brief introduction to quantum algorithms we report on a wide range of...
متن کاملMemetic Algorithms in Continuous Optimization
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”. More formally, to introduce the concept of continuous optimization, some preliminary definitions are required. If we consider sub-sets of real numbers, where the partial order is obvi...
متن کاملContinuous Quantum Hidden Subgroup Algorithms
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals Rmod 1, i.e., the circle, and the additive group Paths of L paths x : [0, 1] → R in real n-space R. Also included is a curious discrete QHS algorithm ...
متن کاملOn Semantics of Algorithms with Continuous Time on Semantics of Algorithms with Continuous Time
We consider a class of algorithms with explicit continuous time, a logic which suuces to write requirement speciications for them in a way close to natural language, and, nally, the corresponding veriication problem. Our main goal is to represent the whole problem in one logic. As algorithms we take block Gurevich machines Gur95] over a signature with addition of reals, and as the logic we take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1998
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(97)00155-7